Fireworks Explosion Can Solve the Set Covering Problem
نویسندگان
چکیده
The Set Covering Problem is a formal model for many practical optimization problems. It consists in finding a subset of columns in a zero/one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we will use a metaheuristic called Fireworks Algorithm (FWA) inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection strategy.
منابع مشابه
Solving Set Covering Problem with Fireworks Explosion
To solve the Set Covering Problem we will use a metaheuristic Fireworks Algorithm inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm (FWA) consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection ...
متن کاملA set-covering formulation for a drayage problem with single and double container loads
This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality b...
متن کاملGlobal Solution to the Cauchy Problem on a Universe Fireworks Model
We prove existence and uniqueness of the global solution to the Cauchy problem on a universe fireworks model with finite total mass at the initial state when the ratio of the mass surviving the explosion, the probability of the explosion of fragments and the probability function of the velocity change of a surviving particle satisfy the corresponding physical conditions. Although the nonrelativ...
متن کاملارائه یک الگوریتم ابتکاری جدید برای حل مساله مکانیابی پوشش کلی
Set covering problem has many applications such as emergency systems, retailers’ facilities, hospitals, radar devices, and military logistics, and it is considered as Np-Hard problems. The goal of set covering problem is to find a subset such that :::::::::union::::::::: of the subset members covered the whole set. In this paper, we present a new heuristic algorithm to solve the set covering pr...
متن کاملFitting of Bezier Curves Using the Fireworks Algorithm
A swarm intelligence based method is presented in this paper to solve the problem of parameterization of given set of planar and spatial data points, which may be uniformly or non-uniformly spaced, for least squares fitting with Bezier curves. The basic framework of the proposed method relies on fireworks algorithm. Performance of the proposed method is tested through several example curves of ...
متن کامل